Finite Adaptability in Multistage Linear Optimization
نویسندگان
چکیده
منابع مشابه
A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization
In this paper, we show a significant role that geometric properties of uncertainty sets, such as symmetry, play in determining the power of robust and finitely adaptable solutions in multistage stochastic and adaptive optimization problems. We consider a fairly general class of multistage mixed integer stochastic and adaptive optimization problems and propose a good approximate solution policy ...
متن کاملLarge-scale Extended Linear-quadratic Programming and Multistage Optimization
Optimization problems in discrete time can be modeled more flexibly by extended linearquadratic programming than by traditional linear or quadratic programming, because penalties and other expressions that may substitute for constraints can readily be incorporated and dualized. At the same time, dynamics can be written with state vectors as in dynamic programming and optimal control. This sugge...
متن کاملPhase-I monitoring of standard deviations in multistage linear profiles
In most modern manufacturing systems, products are often the output of some multistage processes. In these processes, the stages are dependent on each other, where the output quality of each stage depends also on the output quality of the previous stages. This property is called the cascade property. Although there are many studies in multistage process monitoring, there are fewer works on prof...
متن کاملAdjustable Robust Multistage Optimization
Format (5.1.1) covers all uncertain optimization problems considered so far; moreover, in these latter problems the objective f and the right hand side F of the constraints always were bi-affine in x, ζ, (that is, affine in x when ζ is fixed, and affine in ζ, x being fixed), and K was a “simple” convex cone (a direct product of nonnegative rays/Lorentz cones/Semidefinite cones, depending on whe...
متن کاملBox constrained l1 optimization in random linear systems - finite dimensions
Our companion work [10] considers random under-determined linear systems with box-constrained sparse solutions and provides an asymptotic analysis of a couple of modified l1 heuristics adjusted to handle such systems (we refer to these modifications of the standard l1 as binary and box l1). Our earlier work [16] established that the binary l1 does exhibit the so-called phase-transition phenomen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2010
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2010.2049764